Reinforcement learning for active distribution network planning based on Monte Carlo tree search
نویسندگان
چکیده
Active distribution network planning is of importance for utility companies in terms distributed generation investment, reliability assessment, optimal reactive power planning, substation evaluation, and feeder reconfiguration. However, it challenging current model-based optimization problems to guarantee the performances active due an empirically pre-defined solution space. To overcome this issue, paper proposes a performance-oriented method planning. The space model dynamically updated through using deep neural networks which are trained by Monte Carlo tree search-based reinforcement learning until desired satisfied. Simulation results based on standard IEEE 33-bus test system demonstrate that proposed can successfully improve level at lower investment cost compared other cases.
منابع مشابه
Active Reinforcement Learning with Monte-Carlo Tree Search
Active Reinforcement Learning (ARL) is a twist on RL where the agent observes reward information only if it pays a cost. This subtle change makes exploration substantially more challenging. Powerful principles in RL like optimism, Thompson sampling, and random exploration do not help with ARL. We relate ARL in tabular environments to BayesAdaptive MDPs. We provide an ARL algorithm using Monte-C...
متن کاملOn Monte Carlo Tree Search and Reinforcement Learning
Fuelled by successes in Computer Go, Monte Carlo tree search (MCTS) has achieved widespread adoption within the games community. Its links to traditional reinforcement learning (RL) methods have been outlined in the past; however, the use of RL techniques within tree search has not been thoroughly studied yet. In this paper we re-examine in depth this close relation between the two fields; our ...
متن کاملLearning is planning: near Bayes-optimal reinforcement learning via Monte-Carlo tree search
Bayes-optimal behavior, while well-defined, is often difficult to achieve. Recent advances in the use of Monte-Carlo tree search (MCTS) have shown that it is possible to act near-optimally in Markov Decision Processes (MDPs) with very large or infinite state spaces. Bayes-optimal behavior in an unknown MDP is equivalent to optimal behavior in the known belief-space MDP, although the size of thi...
متن کاملScalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search
Bayesian planning is a formally elegant approach to learning optimal behaviour under model uncertainty, trading off exploration and exploitation in an ideal way. Unfortunately, planning optimally in the face of uncertainty is notoriously taxing, since the search space is enormous. In this paper we introduce a tractable, sample-based method for approximate Bayes-optimal planning which exploits M...
متن کاملGuided Monte Carlo Tree Search for Planning in Learned Environments
Monte Carlo tree search (MCTS) is a sampling and simulation based technique for searching in large search spaces containing both decision nodes and probabilistic events. This technique has recently become popular due to its successful application to games, e.g. Poker Van den Broeck et al. (2009) and Go Coulom (2006); Chaslot et al. (2006); Gelly and Silver (2012)). Such games have known rules a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical Power & Energy Systems
سال: 2022
ISSN: ['1879-3517', '0142-0615']
DOI: https://doi.org/10.1016/j.ijepes.2021.107885